A general approximation method for bicriteria minimization problems
نویسندگان
چکیده
منابع مشابه
A general approximation method for bicriteria minimization problems
We present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions. Given 0 < ǫ ≤ 1 and a polynomial-time α-approximation algorithm for the corresponding weighted sum problem, we show how to obtain a bicriteria (α · (1 + 2ǫ), α · (1+ 2 ǫ ))-approximation algorithm for the budget-constrained problem whose running ti...
متن کاملStrongly polynomial-time approximation for a class of bicriteria problems
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo’s parametric method we improve an earlier weakly-polynomial time algorithm.
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملA Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
Abstracts of invited talks blancos of invited talks blanco A moving balls approximation method for a class of smooth constrained minimization Alfred Auslender Université de Lyon, France We introduce a new algorithm for a class of smooth constrained minimization problems which is an iterative scheme that generates a sequence of feasible points that approximates the constraints set by a sequence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.07.003